Adiabatic topological quantum computing

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adiabatic Quantum Computing: An Overview

Quantum computations can be implemented not only by the action of quantum circuits, but by the adiabatic evolution of a system’s Hamiltonian. This can be done by initializing the system into the ground state of a simple Hamiltonian, and then adiabatically evolving the Hamiltonian to one whose ground state encodes the solution to the problem. The time complexity of the problem, or more basically...

متن کامل

Topological Quantum Computing

Quantum computers have the ability to solve certain problems exponentially faster than the best known algorithms for classical computers. Examples include database searching, simulation of quantum systems, and factoring large numbers.[1][2][3] However, the nature of most quantum systems makes the states too fragile for efficient calculations to be done. Topological quantum computing avoids thes...

متن کامل

Graph isomorphism and adiabatic quantum computing

In the Graph Isomorphism (GI) problem two N -vertex graphs G and G′ are given and the task is to determine whether there exists a permutation of the vertices of G that preserves adjacency and transforms G → G′. If yes, then G and G′ are said to be isomorphic; otherwise they are non-isomorphic. The GI problem is an important problem in computer science and is thought to be of comparable difficul...

متن کامل

Ramsey numbers and adiabatic quantum computing.

The graph-theoretic Ramsey numbers are notoriously difficult to calculate. In fact, for the two-color Ramsey numbers R(m,n) with m, n≥3, only nine are currently known. We present a quantum algorithm for the computation of the Ramsey numbers R(m,n). We show how the computation of R(m,n) can be mapped to a combinatorial optimization problem whose solution can be found using adiabatic quantum evol...

متن کامل

Random matrix model of adiabatic quantum computing

We present an analysis of the quantum adiabatic algorithm for solving hard instances of 3-SAT san NPcomplete problemd in terms of random matrix theory sRMTd. We determine the global regularity of the spectral fluctuations of the instantaneous Hamiltonians encountered during the interpolation between the starting Hamiltonians and the ones whose ground states encode the solutions to the computati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review A

سال: 2015

ISSN: 1050-2947,1094-1622

DOI: 10.1103/physreva.92.012336